Bases and dimensions of bivariate hierarchical tensor-product splines

نویسندگان

  • Carlotta Giannelli
  • Bert Jüttler
چکیده

We prove that the dimension of bivariate tensor–product spline spaces of bi– degree (d, d) with maximum order of smoothness on a multi–cell domain (more precisely, on a set of cells from a tensor–product grid) is equal to the number of tensor–product B–spline basis functions, defined by only single knots in both directions, acting on the considered domain. A certain reasonable assumption on the configuration of the cells is required. This result is then generalized to the case of piecewise polynomial spaces, with the same smoothness properties mentioned above, defined on a multi–grid multi– cell domain (more precisely, on a set of cells from a hierarchy of tensor–product grids). Again, a certain reasonable assumption regarding the configuration of cells is needed. Finally, it is observed that this construction corresponds to the classical definition of hierarchical B–spline bases. This allows to conclude that this basis spans the full space of spline functions on multi-grid multi-cell domains under reasonable assumptions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bases of T-meshes and the refinement of hierarchical B-splines

In this paper we consider spaces of bivariate splines of bi–degree (m,n) with maximal order of smoothness over domains associated to a two–dimensional grid. We define admissible classes of domains for which suitable combinatorial technique allows us to obtain the dimension of such spline spaces and the number of tensor–product B–splines acting effectively on these domains. Following the strateg...

متن کامل

Dimensions and bases of hierarchical tensor-product splines

We prove that the dimension of trivariate tensor-product spline space of tri-degree (m,m,m) with maximal order of smoothness over a threedimensional domain coincides with the number of tensor-product B-spline basis functions acting effectively on the domain considered. A domain is required to belong to a certain class. This enables us to show that, for a certain assumption about the configurati...

متن کامل

Partially Nested Hierarchical Refinement of Bivariate Tensor-Product Splines with Highest Order Smoothness

The established construction of hierarchical B-splines starts from a given sequence of nested spline spaces, and hence it is not possible to pursue independent refinement strategies in different parts of a model. In order to overcome this limitation, we generalize hierarchical B-splines to sequences of partially nested spline spaces. We identify assumptions that enable us to define a hierarchic...

متن کامل

An algorithm for low-rank approximation of bivariate functions using splines

We present an algorithm for the approximation of bivariate functions by “low-rank splines”, that is, sums of outer products of univariate splines. Our approach is motivated by the Adaptive Cross Approximation (ACA) algorithm for low-rank matrix approximation as well as the use of low-rank function approximation in the recent extension of the chebfun package to two dimensions. We show that our p...

متن کامل

Finite Element Methods with Hierarchical WEB-splines

Piecewise polynomial approximations are fundamental to geometric modeling, computer graphics, and finite element methods. The classical finite element method uses low order piecewise polynomials defined on polygonal domains. The domains are discretized into simple polygons called the mesh. These polygons might be triangles, quadrilaterals, etc., for two-dimensional domains, and tetrahedra, hexa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Computational Applied Mathematics

دوره 239  شماره 

صفحات  -

تاریخ انتشار 2013